package com.sfd.BinarySearch;

public class FibonacciSearch {
	static final int[] F={0,1,1,2,3,5,8,13,21,34};
	public static void main(String[] args) {
		
	}
	public int search(int[] a, int key){
		int low=0;
		int high=a.length;
		int mid=0;
		int k=0;
		while(a.length>F[k]-1) k++;
		int[] b=new int[F[k]];
		for(int i=0;i<F[k];i++){
			try{
			b[i]=a[i];

			}catch(Exception e){
				b[i]=a[a.length-1];
			}
		}
		
		return -1;
	}
}
